Stability of strict equilibria in best experienced payoff dynamics: Simple formulas and applications

We consider a family of population game dynamics known as Best Experienced Payoff Dynamics. Under these dynamics, when agents are given the opportunity to revise their strategy, they test some possible strategies fixed number times. Crucially, each strategy is tested against new randomly drawn set opponents. The revising agent then chooses whose total payoff was highest in test, breaking ties according tie-breaking rule. Strict Nash equilibria rest points but need not be stable. provide simple formulas and algorithms determine stability or instability strict equilibria.